A graph theory approach for regional controllability of Boolean cellular automata
نویسندگان
چکیده
منابع مشابه
A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملGraph-cellular automata: a generalised discrete urban and regional model
A new type of dynamic spatial model is described: graph-cellular automatoa (graph-CA). First, the proximal model of space and geo-algebra are briefly introduced. Then, the graph-CA model is described, with an emphasis on understanding it as a reworking of the proximal model of space and also of geo-algebra. It is shown that graph-CA with particular structural properties defined in terms of the ...
متن کاملPattern Formation of the FitzHugh-Nagumo Model: Cellular Automata Approach
FitzHugh-Nagumo (FHN) model is a famous Reaction-Diffusion System which first introduced for the conduction of electrical impulses along a nerve fiber. This model is also considered as an abstract model for pattern formation. Here, we have used the Cellular Automata method to simulate the pattern formation of the FHN model. It is shown that the pattern of this model is very similar to those...
متن کاملA Cellular Automata Approach
In this paper, the authors evaluate the benefit of emotions in population dynamics and evolution. The authors enhance a cellular automata (CA) simulating the interactions of competing populations with emotionally inspired rules in communication, interpretation, and action. While CAs have been investigated in studies of population dynamics due to their ability to capture spatial interactions, em...
متن کاملElementary cellular automata as conditional Boolean formulæ
I show that any elementary cellular automata – a class of 1-dimensional, 2-state cellular automata – can be deconstructed into a set of two Boolean operators; I also present a conjecture concerning the computational completeness of a rule and its relationship to complete Boolean operators.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Parallel, Emergent and Distributed Systems
سال: 2019
ISSN: 1744-5760,1744-5779
DOI: 10.1080/17445760.2019.1608442